A Mechanism for Converting Circuit Grammars to Definite Clauses
نویسنده
چکیده
The circuit grammar is a logic grammar developed for knowledge representation of electronic circuits. Knowledge on circuit structures and their functions are coded into the grammar rules. Those grammar rules, when converted into definite clauses, form a logic programme which can parse given circuits and derive electrical behaviour. This paper shows mechanisms for converting circuit grammar rules into definite clauses.
منابع مشابه
Extraposition Grammars
This paper presents a grammar formalism for natural language analysis, called extraposition grammars (XGs), based on the subset of predicate calculus known as definite, or Horn, clauses. It is argued that certain important linguistic phenomena, collectively known in t ransformational grammar as left extraposition, can be described better in XGs than in earlier grammar formalisms based on defini...
متن کاملLogic grammars and XML Schema
This document describes some possible applications of logic grammars to schema processing as described in the XML Schema specification. The term logic grammar is used to denote grammars written in logic-programming systems; the best known logic grammars are probably definite-clause grammars (DCGs), which are a built-in part of most Prolog systems. This paper works with definite-clause translati...
متن کاملExtending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs in Horn clauses. Some linguistic phenomena, such as filler-gap dependencies, are difficult to account for in a completely satisfactory way using simple phrase structured grammar. In the literature of logic grammars ther...
متن کاملSaumer: Sentence Analysis Using Metarules
The SAUMER system uses specifications of natural language grammars, which consist of rules and metarules. to provide a semantic interpretation of an input sentence. The SAUMER ' Specification Language (SSL) is a programming language which combin~ some of the features of generalised phrase structure grammars (Gazdar. 1981 ). like the correspondence between syntactic and semantic rules, with defi...
متن کاملDependency Unification Grammar for PROLOG
The programming language PROLOG has proved to be an excellent tool for implementing natural language processing systems. Its built-in resolution and unification mechanisms are well suited to both accept and generate sentences of artificial and natural languages. Although supporting many different linguistic formalisms, its straightforwardness and elegance have perhaps best been demonstrated wit...
متن کامل